Fast 2-D Bilateral Filtering Method without Kernel-size Dependency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dyadic Wavelet Filtering Method for 2-D Image Denoising

We improve spatially selective noise filtration technique proposed by Xu et al. and wavelet transform scale filtering approach developed by Zheng et al. A novel dyadic wavelet transform filtering method for image denoising is proposed. This denoising approach can reduce noise to a high degree while preserving most of the edge features of images. Different types of images are employed to test in...

متن کامل

Fast and Accurate Arc Filtering for Dependency Parsing

We propose a series of learned arc filters to speed up graph-based dependency parsing. A cascade of filters identify implausible head-modifier pairs, with time complexity that is first linear, and then quadratic in the length of the sentence. The linear filters reliably predict, in context, words that are roots or leaves of dependency trees, and words that are likely to have heads on their left...

متن کامل

Fast O(1) bilateral filtering using trigonometric range kernels

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithms in the image-processing literature. Along with the spatial filter, the edge-preserving bilateral filter involves an additional range kernel...

متن کامل

Fast Nonlinear Filtering via Galerkin's Method

The conditional probability density function of the state of a stochastic dynamic system represents the complete solution to the nonlinear ltering problem because, with the conditional density in hand, optimal estimates of the state can be computed. It is well known that, for systems with continuous dynamics, the conditional density evolves, between measurements, according to Kolmogorov's forwa...

متن کامل

Generalization Accuracy of a Fast 2-D Shape Retrieval Method

In recent work, we presented a correspondence-based approach for real-time retrieval from databases of 2-D shapes. The system performs with high speed and accuracy relative to other published systems as measured on a widely used benchmark dataset. In this paper, we test the generalization accuracy of the approach; i.e., its ability to correctly retrieve shapes from a shape database when the que...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of The Institute of Image Information and Television Engineers

سال: 2010

ISSN: 1881-6908,1342-6907

DOI: 10.3169/itej.64.389